Polynomial degree bounds for matrix semi-invariants

نویسندگان

  • Harm Derksen
  • Visu Makam
چکیده

We study the left-right action of SL n × SL n on m-tuples of n × n matrices with entries in an infinite field K. We show that invariants of degree n 2 − n define the null cone. Consequently, invariants of degree ≤ n 6 generate the ring of invariants if char(K) = 0. We also prove that for m ≫ 0, invariants of degree at least n⌊ √ n + 1⌋ are required to define the null cone. We generalize our results to matrix invariants of m-tuples of p × q matrices, and to rings of semi-invariants for quivers. For the proofs, we use new techniques such as the regularity lemma by Ivanyos, Qiao and Subrahmanyam, and the concavity property of the tensor blow-ups of matrix spaces. We will discuss several applications to algebraic complexity theory, such as a deterministic polynomial time algorithm for non-commutative rational identity testing, and the existence of small division-free formulas for non-commutative polynomials.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On generating the ring of matrix semi-invariants

For a field F, let R(n,m) be the ring of invariant polynomials for the action of SL(n,F) × SL(n,F) on tuples of matrices – (A,C) ∈ SL(n,F)× SL(n,F) sends (B1, . . . , Bm) ∈ M(n,F) to (AB1C , . . . , ABmC ). In this paper we call R(n,m) the ring of matrix semi-invariants. Let β(R(n,m)) be the smallest D s.t. matrix semi-invariants of degree ≤ D generate R(n,m). Guided by the Procesi-Razmyslov-Fo...

متن کامل

On the M-polynomial of planar chemical graphs

Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...

متن کامل

Average Degree-Eccentricity Energy of Graphs

The concept of average degree-eccentricity matrix ADE(G) of a connected graph $G$ is introduced. Some coefficients of the characteristic polynomial of ADE(G) are obtained, as well as a bound for the eigenvalues of ADE(G). We also introduce the average degree-eccentricity graph energy and establish bounds for it.

متن کامل

Determination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial

Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...

متن کامل

A Complete Set of Invariants for LU-Equivalence of Density Operators

We show that two density operators of mixed quantum states are in the same local unitary orbit if and only if they agree on polynomial invariants in a certain Noetherian ring for which degree bounds are known in the literature. This implicitly gives a finite complete set of invariants for local unitary equivalence. This is done by showing that local unitary equivalence of density operators is e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1512.03393  شماره 

صفحات  -

تاریخ انتشار 2015